TSTP Solution File: SEV048^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV048^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:11:50 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 69 ( 24 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 113 ( 12 ~; 0 |; 16 &; 80 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 88 ( 88 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 6 ^ 18 !; 16 ?; 41 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_3,type,
sK0: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_4,type,
sK1: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_5,type,
sK2: ( ( $i > $o ) > ( $i > $o ) > $o ) > $i > $o ).
thf(func_def_8,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f23,plain,
$false,
inference(trivial_inequality_removal,[],[f22]) ).
thf(f22,plain,
$true != $true,
inference(beta_eta_normalization,[],[f16]) ).
thf(f16,plain,
( $true
!= ( ^ [Y0: $i > $o,Y1: $i > $o] : $true
@ ( sK1
@ ^ [Y0: $i > $o,Y1: $i > $o] : $true )
@ ( sK2
@ ^ [Y0: $i > $o,Y1: $i > $o] : $true ) ) ),
inference(primitive_instantiation,[],[f11]) ).
thf(f11,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( $true
!= ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ( $true
= ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) @ ( sK2 @ X0 ) ) )
& ( $true
!= ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9]) ).
thf(f9,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
( ? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( $true
= ( X0 @ X2 @ X1 ) )
& ( ( X0 @ X1 @ X3 )
= $true )
& ( ( X0 @ X2 @ X3 )
!= $true ) )
=> ( ( $true
= ( X0 @ ( sK1 @ X0 ) @ ( sK0 @ X0 ) ) )
& ( $true
= ( X0 @ ( sK0 @ X0 ) @ ( sK2 @ X0 ) ) )
& ( $true
!= ( X0 @ ( sK1 @ X0 ) @ ( sK2 @ X0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( $true
= ( X0 @ X2 @ X1 ) )
& ( ( X0 @ X1 @ X3 )
= $true )
& ( ( X0 @ X2 @ X3 )
!= $true ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
? [X2: $i > $o,X1: $i > $o,X3: $i > $o] :
( ( ( X0 @ X1 @ X2 )
= $true )
& ( ( X0 @ X2 @ X3 )
= $true )
& ( ( X0 @ X1 @ X3 )
!= $true ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
! [X0: ( $i > $o ) > ( $i > $o ) > $o] :
? [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X1 @ X3 )
!= $true )
& ( ( X0 @ X2 @ X3 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
! [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( ( X0 @ X2 @ X3 )
= $true )
& ( ( X0 @ X1 @ X2 )
= $true ) )
=> ( ( X0 @ X1 @ X3 )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
! [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
! [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
? [X0: ( $i > $o ) > ( $i > $o ) > $o] :
! [X1: $i > $o,X2: $i > $o,X3: $i > $o] :
( ( ( X0 @ X2 @ X3 )
& ( X0 @ X1 @ X2 ) )
=> ( X0 @ X1 @ X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM120_pme) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV048^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 18:28:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.37 % (15013)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.15/0.37 % (15015)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.15/0.37 % (15017)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.37 % (15016)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.37 % (15019)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.37 % (15017)Instruction limit reached!
% 0.15/0.37 % (15017)------------------------------
% 0.15/0.37 % (15017)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (15017)Termination reason: Unknown
% 0.15/0.37 % (15017)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (15017)Memory used [KB]: 5373
% 0.15/0.37 % (15017)Time elapsed: 0.003 s
% 0.15/0.37 % (15017)Instructions burned: 2 (million)
% 0.15/0.37 % (15017)------------------------------
% 0.15/0.37 % (15017)------------------------------
% 0.15/0.37 % (15016)First to succeed.
% 0.15/0.37 % (15015)Refutation not found, incomplete strategy
% 0.15/0.37 % (15015)------------------------------
% 0.15/0.37 % (15015)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (15015)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.37
% 0.15/0.37
% 0.15/0.37 % (15015)Memory used [KB]: 5500
% 0.15/0.37 % (15015)Time elapsed: 0.003 s
% 0.15/0.37 % (15015)Instructions burned: 1 (million)
% 0.15/0.37 % (15015)------------------------------
% 0.15/0.37 % (15015)------------------------------
% 0.15/0.37 % (15020)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.37 % (15013)Also succeeded, but the first one will report.
% 0.15/0.37 % (15016)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (15016)------------------------------
% 0.15/0.37 % (15016)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (15016)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (15016)Memory used [KB]: 5500
% 0.15/0.37 % (15016)Time elapsed: 0.004 s
% 0.15/0.37 % (15016)Instructions burned: 1 (million)
% 0.15/0.37 % (15016)------------------------------
% 0.15/0.37 % (15016)------------------------------
% 0.15/0.37 % (15012)Success in time 0.005 s
% 0.15/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------